Some Features of the Game between the Supersonic ASM and the Counterattack AMM

Since the Gulf war, defense missile systems against tactical ballistic missiles have been highlighted and the author also have published some studies. Recently some studies also have appeared, however, it seems that the threat of anti-surface-missiles (ASMs) to current ground sites and its countermeasures have not been sufficiently studied to date. A typical medium or long range surface-to-air missile (SAM) system is composed of ground radar sites for tracking and control, missiles, launchers, and other support systems. The system can intercept a subsonic cruising missile, but the possibility of intercepting a supersonic maneuvering missile is questionable. As is explained later, it is possible to produce a low cost long range ASM, with supersonic velocity and heavy maneuvers capable of attacking a SAM site. With the cost of one modern fighter, hundreds of such ASMs can be produced, therefore, it is highly probable that hundreds of ASMs will arrive in advance of the attacking aircraft. That is, for a SAM system to function effectively, a counter attack system against a flood of ASMs is essential. In this lecture, a cruising type ASM is briefly explained first. Next, a ballistic type ASM is explained. Then, a counterattack system by employing short range ground launched IR missiles is explained. In the following, some aspects of the game between the ground site defense system and the ASM are explained. The SAM site is assumed to be defended by guns and short range IR anti-missile missiles (AMMs). In the following, the characteristics of the AMM are explained. Next, some features of the game problem between the ASM and the AMM are studied and discussed in detail. A few comments are also added about the study. Finally the results are briefly summarized. Abstract: Constrained global optimization problems (COP) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. In this speech, we would like to convey a recent investigation on the performance of several deterministic commercial optimization solvers in dealing with the COP. Additionally, we also discuss a variety of new efficient interval partitioning approaches (IP) that involve a new parallel sub-space partitioning method as well as a generic adaptive tree search approach that can also be implemented in non-interval Branch and Bound algorithms. New and existing IP methods are compared with commercial solvers on a test bed of COP benchmarks from the literature. The findings indicate …